ISSN 1342-2804 User Manual for SFSDP: a Sparse versions of Full SemiDefinite Programming Relaxation for Sensor Network Localization Problems
نویسندگان
چکیده
SFSDP is a Matlab package for solving sensor network localization problems. The package contains four functions, SFSDP.m, SFSDPplus.m, generateProblem.m, test SFSDP.m, and some numerical examples. The function SFSDP.m is an Matlab implementation of the semidefinite programming (SDP) relaxation proposed in the recent paper by Kim, Kojima and Waki for sensor network localization problems, as a sparse version of the full semidefinite programming relaxation (FSDP) by Biswas and Ye. To improve the efficiency of FSDP, SFSDP.m exploits the aggregated and correlative sparsity of a sensor network localization problem. The function SFSDPplus.m analyzes the input data of a sensor network localization problem, solves the problem, and displays graphically computed locations of sensors. The function generateProblem.m creates numerical examples of sensor network localization problems with some typical anchor locations. The function test SFSDP.m is for numerical experiments on SFSDPplus.m applied to test problems generated by generateProblem.m. The package SFSDP and this manual are available at http://www.is.titech.ac.jp/∼kojima/SFSDP
منابع مشابه
SFSDP: a Sparse Version of Full SemiDefinite Programming Relaxation for Sensor Network Localization Problems
SFSDP is a Matlab package for solving a sensor network localization problem. These types of problems arise in monitoring and controlling applications using wireless sensor networks. SFSDP implements the semidefinite programming (SDP) relaxation proposed in Kim et al. [2009] for sensor network localization problems, as a sparse version of the full semidefinite programming relaxation (FSDP) by Bi...
متن کامل1342 - 2804 A Continuation Method for Large - sized Sensor Network Localization Problems
The solution methods based on semidefinite programming (SDP) relaxations for sensor network localization (SNL) problems can not handle very large-sized SNL problems. We present a continuation method using the gradient descent method to efficiently solve large-sized SNL problems. We first formulate the problem as an unconstrained optimization problem and then apply the continuation on the distan...
متن کاملISSN 1342-2804 User Manual for SparsePOP: a Sparse Semidefinite Programming Relaxation of Ppolynomial Optimization Problems
SparesPOP is a MATLAB implementation of a sparse semidefinite programming (SDP) relaxation method for approximating a global optimal solution of a polynomial optimization problem (POP) proposed by Waki et al. The sparse SDP relaxation exploits a sparse structure of polynomials in POPs when applying “a hierarchy of LMI relaxations of increasing dimensions” by Lasserre. The efficiency of SparsePO...
متن کاملParallel Implementation of Successive Sparse SDP Relaxations for Large-Scale Euclidean Distance Geometry Problems
The Euclidean distance geometry problem (EDGP) includes locating sensors in a sensor network and constructing a molecular configuration using given distances in the two or three-dimensional Euclidean space. When the locations of some nodes, called anchors, are given, the problem can be dealt with many existing methods. An anchorfree problem in the three-dimensional space, however, is a more cha...
متن کاملISSN 1342-2804 Invariance under Affine Transformation in Semidefinite Programming Relaxation for Polynomial Optimization Problems
Given a polynomial optimization problem (POP), any affine transformation on its variable vector induces an equivalent POP. Applying Lasserre's SDP relaxation to the original and the transformed POPs, we have two SDPs. This paper shows that these two SDPs are isomorphic to each other under a nonsingular linear transformation, which maps the feasible region of one SDP onto that of the other isomo...
متن کامل